Genetic Algorithm for Optimizing Traveling Salesman Problems with Time Windows (TSP-TW)
نویسندگان
چکیده
منابع مشابه
Time-Dependent Traveling Salesman Problem with Multiple Time Windows
The TSP, VRP and OP problems with time constraints have one common sub-problem – the task of finding the minimum route duration for a given order of customers. While much work has been done on routing and scheduling problems with time windows, to this date only few articles considered problems with multiple time windows. Moreover, since the assumption of constant travel time between two locatio...
متن کاملImmune-Genetic Algorithm for Traveling Salesman Problem
The Traveling Salesman Problem (TSP), first formulated as a mathematical problem in 1930, has been receiving continuous and growing attention in artificial intelligence, computational mathematics and optimization in recent years. TSP can be described as follows: Given a set of cities, and known distances between each pair of cities, the salesman has to find a shortest possible tour that visits ...
متن کاملThe A Priori Dynamic Traveling Salesman Problem with Time Windows
The remarkable advances in telecommunications and information technology have enabled companies to focus on velocity and timeliness throughout the supply chain. To achieve these competitive advantages, they must be able to make effective use of the vast amount of real-time information now available to them. The Dynamic Vehicle Routing Problem (DVRP) is a prime example of a distribution context ...
متن کاملTime Dependent Traveling Salesman Problem with Time Windows: Properties and an Exact Algorithm
In this paper, we deal with the Time-Dependent Traveling Salesman Problem with Time Windows (TDTSPTW ). Firstly, we prove that under special conditions the TDTSPTW can be solved as an Asymmetric Traveling Salesman Problem with Time Windows (ATSPTW ), with suitable-defined time windows and (constant) travel times. Secondly, we show that, if the special conditions do not hold, the ATSPTW optimal ...
متن کاملEfficient Constraint Handling in Electromagnetism-Like Algorithm for Traveling Salesman Problem with Time Windows
The traveling salesman problem with time windows (TSPTW) is a variant of the traveling salesman problem in which each customer should be visited within a given time window. In this paper, we propose an electromagnetism-like algorithm (EMA) that uses a new constraint handling technique to minimize the travel cost in TSPTW problems. The EMA utilizes the attraction-repulsion mechanism between char...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Artificial Intelligence & Robotics (IJAIR)
سال: 2019
ISSN: 2686-6269
DOI: 10.25139/ijair.v1i1.2024